Explicit analytical solution for scaling quantum graphs
نویسندگان
چکیده
منابع مشابه
Explicit analytical solution for scaling quantum graphs.
We show that scaling quantum graphs with arbitrary topology are explicitly analytically solvable. This is surprising since quantum graphs are excellent models of quantum chaos and quantum chaotic systems are not usually explicitly analytically solvable.
متن کاملJ an 2 00 3 Explicit , analytical solution of scaling quantum graphs
Based on earlier work on regular quantum graphs we show that a large class of scaling quantum graphs with arbitrary topology are explicitly analytically solvable. This is surprising since quantum graphs are excellent models of quantum chaos and quantum chaotic systems are not usually explicitly analytically solvable.
متن کاملExplicit spectral formulas for scaling quantum graphs.
We present an exact analytical solution of the spectral problem of quasi-one-dimensional scaling quantum graphs. Strongly stochastic in the classical limit, these systems are frequently employed as models of quantum chaos. We show that despite their classical stochasticity all scaling quantum graphs are explicitly solvable in the form E(n) =f (n) , where n is the sequence number of the energy l...
متن کاملua nt - p h / 03 01 00 3 v 1 3 J an 2 00 3 Explicit , analytical solution of scaling quantum graphs
Based on earlier work on regular quantum graphs we show that a large class of scaling quantum graphs with arbitrary topology are explicitly analytically solvable. This is surprising since quantum graphs are excellent models of quantum chaos and quantum chaotic systems are not usually explicitly analytically solvable.
متن کاملSolution of scaling quantum networks
We show that all scaling quantum graphs are explicitly integrable, i.e. any one of their spectral eigenvalues En is computable analytically, explicitly, and individually for any given n. This is surprising, since quantum graphs are excellent models of quantum chaos [see, e.g., T. Kottos and H. Schanz, Physica E 9, 523 (2001)]. 05.45.Mt Typeset using REVTEX 1 Graphs are networks of bonds and ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2003
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.68.055201